Experiments in Infinite States Verification in Game-Theoretic Logics

Many practical problems where the environment is not in the system’s control such as service orchestration and contingent and multi-agent planning can be modelled in game-theoretic logics (e.g. ATL). But most work on verification methods for such logics is restricted to finite state cases. [De Giacomo et al., 2010] develops a situation calculusbased logical framework for representing such infinite state game-type problems together with a verification method based on fixpoint approximates and regression. In this paper, we describe some case studies we have done to evaluate this method. We specify some example domains and show that the verification method does allow us to verify various properties. We also find some examples where the method must be extended to exploit information about the initial state and state constraints in order to work. Our example domains can be used to evaluate other infinite state verification methods.